Capacity Characterized by a Medium Cut
نویسندگان
چکیده
منابع مشابه
Postharvest Handling of Cut Campanula medium Flowers
Various postharvest treatments were evaluated for effect on longevity and quality of cut Campanula medium L. ‘Champion Blue’ and ‘Champion Pink’ stems. Stems stored at 2 °C either wet or dry had no difference in vase life or percent flowers opened; however, flowers stored dry had a slightly greater percentage of senesced flowers at termination. Increasing storage duration from 1 to 3 weeks decr...
متن کاملWeighted Convolution Measure Algebras Characterized by Convolution Algebras
The weighted semigroup algebra Mb (S, w) is studied via its identification with Mb (S) together with a weighted algebra product *w so that (Mb (S, w), *) is isometrically isomorphic to (Mb (S), *w). This identification enables us to study the relation between regularity and amenability of Mb (S, w) and Mb (S), and improve some old results from discrete to general case.
متن کاملOrdered semigroups characterized by their intuitionistic fuzzy bi-ideals
Fuzzy bi-ideals play an important role in the study of ordered semigroupstructures. The purpose of this paper is to initiate and study theintiuitionistic fuzzy bi-ideals in ordered semigroups and investigate thebasic theorem of intuitionistic fuzzy bi-ideals. To provide thecharacterizations of regular ordered semigroups in terms of intuitionisticfuzzy bi-ideals and to discuss the relationships ...
متن کاملPower Function Distribution Characterized by Dual Generalized Order Statistics
The dual generalized order statistics is a unified model which contains the well known decreasingly ordered random data such as (reversed ordered) order statistics and lower record values. In the present paper, some characterization results on the power function distribution based on the properties of dual generalized order statistics are provided. The results are proved without any rest...
متن کاملColoring Graphs Characterized by a Forbidden Subgraph
The Coloring problem is to test whether a given graph can be colored with at most k colors for some given k, such that no two adjacent vertices receive the same color. The complexity of this problem on graphs that do not contain some graph H as an induced subgraph is known for each fixed graph H. A natural variant is to forbid a graph H only as a subgraph. We call such graphs strongly H-free an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Clinical & Experimental Nephrology
سال: 2018
ISSN: 2472-5056
DOI: 10.21767/2472-5056.100056